Online unit clustering: Variations on a theme

Online unit clustering: Variations on a theme

Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We study several variants and generalizations of the online unit clustering problem, which are inspired by variants of packing and scheduling problems in the literature.

Variations on a theme.

A ring satisfying x = x is necessarily commutative. We consider a variety of weaker forms of this condition and show that many but not all of them imply commutativity. We also present a variety of elementary proofs of the fact that x = x implies commutativity.

Variations on a Theme

Variations on a Montagovian theme

What are the objects of knowledge, belief, probability, apriority or analyticity? For at least some of these properties, it seems plausible that the objects are sentences, or sentence-like entities. However, results from mathematical logic indicate that sentential properties are subject to severe formal limitations. After surveying these results, I argue that they are more problematic than ofte...

Better Bounds on Online Unit Clustering

Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. We continue work initiated by Chan and Zarrabi-Zadeh on determining the competitive ratio of the online version of this problem. For the one-dimensional case, we develop a deterministic algorithm, improving the best kn...